package LeetCode._01算法入门.day08广度深度优先搜索;

/**
 * @author 挚爱之夕
 * @date 2022-02-27 - 02 - 27 - 14:02
 * @Description 树节点
 * @Version 1.0
 */
public class TreeNode {
    public int val;
    public TreeNode left;
    public TreeNode right;

    public TreeNode() {
    }

    public TreeNode(int val) {
        this.val = val;
    }

    public TreeNode(int val, TreeNode left, TreeNode right) {
        this.val = val;
        this.left = left;
        this.right = right;
    }
}
